Some examples related to colorings

نویسندگان

  • Michael van Hartskamp
  • Jan van Mill
چکیده

We complement the literature by proving that for a fixed-point free map f : X → X the statements (1) f admits a finite functionally closed cover A with f [A]∩A = ∅ for all A ∈ A (i.e., a coloring) and (2) βf is fixed-point free are equivalent. When functionally closed is weakened to closed, we show that normality is sufficient to prove equivalence, and give an example to show it cannot be omitted. We also show that a theorem due to van Mill is sharp: for every n ≥ 2 we construct a strongly zero-dimensional Tychonov space X and a fixed-point free map f : X → X such that f admits a closed coloring, but no coloring has cardinality less than n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nowhere-harmonic Colorings of Graphs

Abstract. Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic colorings and analogues of the chromatic polynomial and Stanley’s theorem relating negative evaluations of the chromatic polynomial to acyclic orientatio...

متن کامل

Counting dominating sets and related structures in graphs

We first consider some problems related to the maximum number of dominating (or strong dominating) sets in a regular graph. Our techniques, centered around Shearer’s entropy lemma, extend to a reasonably broad class of graph parameters enumerating vertex colorings that satisfy conditions on the multiset of colors appearing in neighborhoods (either open or closed). Dominating sets and strong dom...

متن کامل

Non-repetitive colorings of infinite sets

In this paper we investigate colorings of sets avoiding similarly colored subsets. If S is an arbitrary colored set and T is a "xed family of bijections of S to itself, then two subsets A; B ⊆ S are said to be colored similarly with respect to T, if there exists a transformation t ∈T mapping A onto B, and preserving a coloring of A. This general setting covers some well-known topics such as non...

متن کامل

Perfect $2$-colorings of the Platonic graphs

In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and  the icosahedral graph.

متن کامل

Colorings of hypergraphs with large number of colors

The paper deals with the well-known problem of Erdős and Hajnal concerning colorings of uniform hypergraphs and some related questions. Let m(n, r) denote the minimum possible number of edges in an n-uniform non-r-colorable hypergraph. We show that for r > n, c1 n lnn m(n, r) rn C1 n lnn, where c1, C1 > 0 are some absolute constants.

متن کامل

How many delta-matroids are there?

J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcct-colorings, and rainbow colorings, and many more. N. Linial (1986) showed that the chromatic polynomial χ(G;X) is #P-hard to evaluate for all but three values X = 0, 1, 2, wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000